home *** CD-ROM | disk | FTP | other *** search
- Path: wagner.spc.videotron.ca!news
- From: yvesb@sp.rp.collegebdeb.qc.ca (Yves Bergeron)
- Newsgroups: comp.lang.c++
- Subject: Re: Fastest Sorting Algorithm?
- Date: Sat, 06 Apr 1996 13:01:31 GMT
- Organization: College de Bois-de-Boulogne, Montreal
- Message-ID: <4k5q1s$h53@wagner.spc.videotron.ca>
- References: <Dou55w.7MB@novice.uwaterloo.ca> <DpAxtI.3w9@undergrad.math.uwaterloo.ca>
- NNTP-Posting-Host: 205.151.5.53
- X-Newsreader: Forte Free Agent 1.0.82
-
- most of the time, It's depend of the number of element and if the
- data are partialy sorted or not
-
- YVes
-
-
- sckettle@undergrad.math.uwaterloo.ca (Steve Kettle) wrote:
-
- >In article <Dou55w.7MB@novice.uwaterloo.ca>,
- >Gerald Wang <GTWANG@HELIX.Watstar.UWaterloo.CA> wrote:
- >>A classmate was recently asked during a job interview what is the fastest
- >>method to sort an array of numbers. He replied "Use a quicksort." They
- >>asked "And how would you make it faster still?" He couldn't come up with
- >>much...end of interview.
- >>
- >>I know it's a vague question... Any ideas on what they were asking? Or
- >>what the right answer is?
- >>
- >>Gerald
- >>
- >>-------------------------------------------------------------------------
- >>Gerald Wang
- >>http://www.csclub.uwaterloo.ca/~gtwang
- >>
- >>
-
- >Well you could use a type of bucket sorting algorithm which is faster than
- >quicksort when sorting integers. How to make it faster I don't know - you
- >don't really make algortithms faster you make code implementations of
- >algorithms faster. Mybe they meant tweaking stratigies for quicksort like how
- >to choose a pivot element. Who knows.
-
- >--
-
-
-